Dynamics in argumentation with single extensions: attack refinement and the grounded extension

نویسندگان

  • Guido Boella
  • Souhila Kaci
  • Leon van der Torre
چکیده

We introduce nine attack refinement principles stating whether the extension stays the same if we add a single attack, and we show that the grounded extension satisfies five of them. We define also an extension called acyclic attack refinement by adding a loop condition, and we show that the grounded extension satisfies one of the acyclic attack refinement principles. Moreover, we define an extension called conditional attack refinement taking alternative attackers into account, and we give an example of a conditional attack refinement principle satisfied by the grounded extension.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension

In this paper we consider the dynamics of abstract argumentation in Baroni and Giacomin’s framework for the evaluation of extension based argumentation semantics. Following Baroni and Giacomin, we do not consider individual approaches, but we define general principles or postulates that individual approaches may satisfy. In particular, we define abstraction principles for the attack relation, a...

متن کامل

CEGARTIX v2017-3-13: A SAT-Based Counter-Example Guided Argumentation Reasoning Tool

We present CEGARTIX, version 2017-3-13, for the International Competition on Computational Models of Argumentation (ICCMA) 2017. Main changes are the addition of support for more reasoning tasks, relying on variations of existing Boolean encodings. The tool CEGARTIX is now capable of deciding credulous and skeptical acceptance, and enumeration of all (or up to a pre-specified bound) extensions ...

متن کامل

A Matrix Approach for Weighted Argumentation Frameworks: a Preliminary Report

The assignment of weights to attacks in a classical Argumentation Framework allows to compute semantics by taking into account the different importance of each argument. We represent a Weighted Argumentation Framework by a non-binary matrix, and we characterize the basic extensions (such as w-admissible, wstable, w-complete) by analysing sub-blocks of this matrix. Also, we show how to reduce th...

متن کامل

Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming

In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [6] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumenta...

متن کامل

Dynamics of Argumentation Systems: A Basic Theory

The changing of arguments and their attack relation is an intrinsic property of a variety of argumentation systems. So, it is very important to efficiently figure out how the status of arguments in a system evolves when the system is updated. However, unlike other areas of argumentation that have been deeply explored, such as argumentation semantics, proof theories, and algorithms, etc., dynami...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009